Version of 10-18-2001 BASIC COMMUTATORS AS RELATORS

نویسندگان

  • David A. Jackson
  • Anthony M. Gaglione
  • Dennis Spellman
چکیده

Charles Sims, [7] has asked whether or not the lower central subgroup γn(F ) of a free group F coincides with the normal closure in F of the set of basic commutators of weight n. Here, we investigate variations of this question where we consider other varieties or other sets of commutators. We also give brief new proofs that this question has a positive answer in the previously known cases for weight n at most 4 and for the case where n = 5 and F is free with rank 2. We show that for n ≥ 4, γn(F ) is the normal closure in F of the set of basic commutators having weights n through 2n− 4, inclusive. This is a common generalization of Sims’ result for weight 4 and a result of Martin Ward, but both of these earlier results are used in the proof. 1: Introduction and Notation For a natural number r ≥ 2, F = Fr is the free group on the ordered alphabet X = {x1, x2, . . . , xr}. We write y for x−1yx and [y, x] for the commutator y−1x−1yx. If A and B are subsets of any group G, then A is the normal closure of A in G and [A,B] is the subgroup of G that is generated by the set of elements [a, b] where a ∈ A and b ∈ B. We write [z, x, y] for the commutator [[z, x], y]. The weight of a commutator c is denoted by wt(c). We follow Marshall Hall’s definition for basic commutators. See, for example, [2] or [6]. Fix an order on the alphabet X. (1) The basic commutators of weight one are the letters of X taken in this order. (2) Having defined and ordered the basic commutators of weight less than n, the basic commutators of weight n are all of the commutators [ci, cj ] which satisfy the conditions: (a) ci and cj are basic commutators with n = wt(ci) + wt(cj). (b) In the order that has been chosen for basic commutators of weight less than n, cj < ci. (c) If ci = [cs, ct] where cs and ct are basic commutators, then ct ≤ cj in the order that has been chosen for basic commutators of weight less than n. (3) The basic commutators of weight n follow all of the basic commutators of weight less than n in the order for the basic commutators of weight less than n+1, but the basic commutators of weight n may be ordered arbitrarily. While we may order the commutators of weight n arbitrarily, the choices that we make will have consequences for which commutators of higher weights are basic and which are not. For example, depending upon which order we use for the commutators [x2, x1] and [x3, x1] in weight 2, either [[x2, x1], [x3, x1]] or else [[x3, x1], [x2, x1]] 1991 Mathematics Subject Classification. 20F05, 20F12, 20F18.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Basic commutators in weights six and seven as relators

Charles Sims has asked whether or not the lower central subgroup γn(F ) of a free group F coincides with the normal closure in F of the basic commutators of weight n. This question has a positive answer in weights at most 5, but remains an open question in general. In earlier work with Gaglione and Spellman, it was shown that γn(F ) is the normal closure in F of the basic commutators of weights...

متن کامل

Weight Five Basic Commutators as Relators

Charles Sims has asked whether or not, for a free group F , the lower central subgroup γn(F ) coincides with the normal closure in F of the set of basic commutators of weight n. In this paper, we will show that Sims’ question has a positive answer when n = 5. The longest part of the proof is showing that this is true when F has rank 3. Once this is known, the results for higher ranks follow fai...

متن کامل

Computing Braid Groups of Graphs with Applications to Robot Motion Planning

We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph. A key ingredient is a new motion planning algorithm whose complexity is linear in the number of edges and quadratic in the number of robots. The computing algorithm implies that 2-point braid groups of all light plan...

متن کامل

Comment about UV regularization of basic commutators in string theories

Recently proposed by Hwang, Marnelius and Saltsidis zeta regularization of basic commutators in string theories is generalized to the string models with non-trivial vacuums. It is shown that implementation of this regularization implies the cancellation of dangerous terms in the commutators between Virasoro generators, which break Jacobi identity. It is well known what the role plays the proble...

متن کامل

Separating Quasiconvex Subgroups of Right-angled Artin Groups

A graph group, or right-angled Artin group, is a group given by a presentation where the only relators are commutators of the generators. A graph group presentation corresponds in a natural way to a simplicial graph, with each generator corresponding to a vertex, and each commutator relator corresponding to an edge. Suppose that G is a graph group whose corresponding graph is a tree and H is a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001